Nuprl Lemma : ecl-halt-nil 11,40

ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), x:ecl(dsda), n:.
(ecl-halt(dsdax)(n,[]))  False 
latex


Definitionsx:A  B(x), P  Q, x:AB(x), t  T, x:AB(x), ecl(dsda), , type List, False, Type, prop{i:l}, event-info(ds;da), [], ecl-halt(dsdax), f(a), P  Q, x:AB(x), xt(x), l_exists(LTx.P(x)), #$n, {x:AB(x)} , , s = t, (x  l), A, left + right, P  Q, void, P  Q, A  B, P  Q, a < b, star-append(TPQ), iseg(Tl1l2), append(asbs), Knd, , ma-valtype(dak), decl-state(ds), spreadn(ax,y,z.t(x;y;z)), <ab>, subtype(ST), l_all(LTx.P(x)), b, cons(carcdr), ecl ind eclcatch compseq tag def, ecl ind eclthrow compseq tag def, ecl ind eclact compseq tag def, ecl ind eclrepeat compseq tag def, ecl ind eclor compseq tag def, ecl ind ecland compseq tag def, ecl ind eclseq compseq tag def, ecl ind eclbase compseq tag def, x.A(x), guard(T), fpf(Aa.B(a)), Id, ||as||, top, fpf-cap(feqxz), A c B, sq_type(T), sqequal(st), decidable(P), concat(ll)
Lemmasconcat wf, decidable lt, decidable false, Knd sq, length wf1, append is nil, Id wf, fpf wf, ecl-induction, assert wf, l all wf2, decl-state wf, ma-valtype wf, bool wf, Knd wf, append wf, iseg wf, star-append wf, le wf, not wf, l member wf, l exists wf, iff wf, ecl-halt wf, event-info wf, false wf, nat wf, ecl wf

origin